Vertices cannot be hidden from quantum spatial search for almost all random graphs
نویسندگان
چکیده
منابع مشابه
Vertices cannot be hidden from quantum spatial search for almost all random graphs
Adam Glos, 2 Ryszard Kukulski, 3 Aleksandra Krawiec, 3, ∗ and Zbigniew Pucha la 4 Institute of Theoretical and Applied Informatics, Polish Academy of Sciences, ul. Ba ltycka 5, 44-100 Gliwice, Poland Institute of Informatics, Silesian University of Technology, ul. Akademicka 16, 44-100 Gliwice, Poland Institute of Mathematics, University of Silesia, ul. Bankowa 14, 40-007 Katowice, Poland Facul...
متن کاملSpatial Search by Quantum Walk is Optimal for Almost all Graphs.
The problem of finding a marked node in a graph can be solved by the spatial search algorithm based on continuous-time quantum walks (CTQW). However, this algorithm is known to run in optimal time only for a handful of graphs. In this work, we prove that for Erdös-Renyi random graphs, i.e., graphs of n vertices where each edge exists with probability p, search by CTQW is almost surely optimal a...
متن کاملQuantum Measurements Cannot be Proved to be Random
The postulates of quantum mechanics say that when a measurement is made on a quantum state the outcome of the measurement is random [1]. In classical physics, if the state of a closed system is known, then the state of that system is completely predictable. As far as we know, randomness only exists in quantum mechanics [2]. Everett proposed a purely unitary quantum theory [3] (without probabili...
متن کاملHDD cannot be advocated for all patients.
Sir, Saner and colleagues have made a good case for home haemodialysis (HHD) as an effective renal replacement therapy in Switzerland [1]. Yet, in the last paragraph of their case–cohort study of 58 patients, they admit that patient selection may have influenced their results. We agree. Our analysis of a much larger cohort, that of the United States Renal Data System, used the standardized mort...
متن کاملThe union-closed sets conjecture almost holds for almost all random bipartite graphs
Frankl’s union-closed sets conjecture states that in every finite unionclosed family of sets, not all empty, there is an element in the ground set contained in at least half of the sets. The conjecture has an equivalent formulation in terms of graphs: In every bipartite graph with least one edge, both colour classes contain a vertex belonging to at most half of the maximal stable sets. We prove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2018
ISSN: 1570-0755,1573-1332
DOI: 10.1007/s11128-018-1844-7